Least Expected Time Paths in Stochastic Schedule-Based Transit Networks
نویسندگان
چکیده
منابع مشابه
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random ...
متن کاملAdaptive least-expected time paths in stochastic, time-varying transportation and data networks
In congested transportation and data networks, travel (or transmission) times are time-varying quantities that are at best known a priori with uncertainty. In such stochastic, time-varying (or STV) networks, one can choose to use the a priori least-expected time (LET) path or one can make improved routing decisions en route as traversal times on traveled arcs are experienced and arrival times a...
متن کاملStochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints
This paper proposes a stochastic user equilibrium SUE assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost function encompassing five components: 1 ride time, which is composed of invehicle and waiting times, 2...
متن کاملReliability-Based Transit Assignment for Congested Stochastic Transit Networks
This paper proposes a Nonlinear Complementarity Problem (NCP) formulation for the risk-aversive stochastic transit assignment problem in which in-vehicle travel time, waiting time, capacity and the effect of congestion are considered as stochastic variables simultaneously and both their means and variances are incorporated into the formulation. A new congestion model is developed and captured i...
متن کاملOptimal Slack Time for Schedule-Based Transit Operations
In order to improve service reliability, many transit agencies add a significant amount of slack in the schedule. However, too much slack in the schedule reduces service frequency. We study the problem of determining the optimal slack that minimizes the passengers’ expected waiting times under schedule-based control. By associating with a D/G/c queue model, we show that the system is stable if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2016
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2016/7609572